Polynomials and Polyominoes
نویسنده
چکیده
J. B. Kelly † American Mathematical Monthly 73 (1966) 464–471 1. The associated polynomial. Let S be a finite set of lattice points (i.e. points with integral coordinates) in k-dimensional Euclidean space, Ek. There will be no loss in generality in assuming that S is contained in E′ k, where E ′ k is that portion of Ek in which all points have nonnegative coordinates. With the point p of S having the integral coordinates n1, n2, · · · , nk, we associate the monomial
منابع مشابه
The number of convex polyominoes and the generating function of Jacobi polynomials
Lin and Chang gave a generating function of convex polyominoes with an m+1 by n + 1 minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is m+ n+mn m+ n ( 2m+ 2n 2m ) − 2mn m+ n ( m+ n m )2 . We show that this result can be derived from some binomial coefficients identities related to the generating function of Jacobi polynomials. Some (binomia...
متن کاملA generalization of the Fibonacci word fractal and the Fibonacci snowflake
In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. We associate with this family of words a family of curves that are like the Fibonacci word fractal and reveal some fractal features. Finally, we describe an infinite family of polyominoes stems from the generalized Fibonacci words and we study some of their geome...
متن کاملCombinatorics of labelled parallelogram polyominoes
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by northeast lattice paths going from the origin to a point (k, n). The numbers from 1 to n (the labels) are bijectively attached to the n north steps of the above-bounding path, with the condition that they appear in increasing values along consecu...
متن کاملThe sandpile model on a bipartite graph, parallelogram polyominoes, and a q, t-Narayana polynomial
We give a polyomino characterisation of recurrent configurations of the sandpile model on the complete bipartite graph Km,n in which one designated vertex is the sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is a m× n rectangle. Other combinatorial structures appear in special cases of this correspondence: for example ...
متن کامل0 Statistics of lattice animals ( polyominoes ) and polygons
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, τ = 4.062570(8), for the growth constant of lattice animals and confirms to a very high degree of certainty that the generating function has a logarithmic divergence. We prove the bound τ >...
متن کاملInversion polynomials for 321-avoiding permutations
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002